Comments on 'An inequality on guessing and its application to sequential decoding'
نویسنده
چکیده
In the above paper,1 an asymptotically tight upper bound on the th moment ( 0) of the minimal number of guesses required to determine the value of a random variable was derived. We show that we can tighten this bound for the case of positive integer moments (when = 1, the bound is improved by a factor of 2) and that the new bound also applies to a class of nonminimal guessing sequences.
منابع مشابه
An inequality on guessing and its application to sequential decoding
Let (X, Y) be a pair of discrete random variables with X taking one of M possible values. Suppose the value of X is to be determined, given the value of Y, by asking quest ions of the form “Is X equal to z?” until the answer is “Yes.” Let G(r 1 y) denote the number of guesses in any such guessing scheme when X = x, Y = y. W e prove that 1 1+/J E[G(X IY)‘] 2 (l+InM)-P~ for any p > 0. This provid...
متن کاملAn Inequality on Guessing and its Application to Sequential Decoding - Information Theory, IEEE Transactions on
Let (X, Y) be a pair of discrete random variables with X taking one of M possible values. Suppose the value of X is to be determined, given the value of Y, by asking questions of the form “Is X equal to z?” until the answer is “Yes.” Let G(z 1 y) denote the number of guesses in any such guessing scheme when X = x, Y = y. We prove that
متن کاملThe Impact of Correction for Guessing Formula on MC and Yes/No Vocabulary Tests' Scores
A standard correction for random guessing (cfg) formula on multiple-choice and Yes/Noexaminations was examined retrospectively in the scores of the intermediate female EFL learners in an English language school. The correctionwas a weighting formula for points awarded for correct answers,incorrect answers, and unanswered questions so that the expectedvalue of the increase in test score due to g...
متن کاملJoint Source-Channel Coding and Guessing with Application to Sequential Decoding
We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct the source output at the destination within a prescribed distortion level with respect to (w.r.t.) some distortion measure. The decoder is a guessing decoder in the sense t...
متن کاملSequential Optimality Conditions and Variational Inequalities
In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 43 شماره
صفحات -
تاریخ انتشار 1997